package realQuestion.kedaXunfei;

import java.util.Scanner;

public class Main1 {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int T = scanner.nextInt();
        int[][] nums = new int[T][3];

        for (int i = 0; i < T; i++) {
            for (int j = 0; j < 3; j++) {
                nums[i][j]=scanner.nextInt();
            }
        }

        for (int i = 0; i < T; i++) {
            int wide=nums[i][0];
            int lon=nums[i][1];
            int hei=nums[i][2];
            int min = Math.min(wide, lon);
            int max=Math.max(wide,lon);
            if (min>=hei*2&&max<=min*2){
                System.out.println("good");
            }else {
                System.out.println("bad");
            }
        }



    }
}
